Common distance vectors between Costas arrays
نویسندگان
چکیده
We investigate the distance vectors contained in individual Costas arrays and in pairs of Costas arrays, and prove some rigorous results in the case of the algebraically constructed arrays. Overall, it appears that the set with the property that every Costas array has a distance vector in this set, or that every pair of Costas arrays with a common vector have a common vector in this set, is in both cases surprisingly small. Further, we study Costas arrays with the additional property that they represent configurations of nonattacking kings or queens: in the former case, we demonstrate that such arrays are either sporadic or produced by a sub-method of the Lempel construction; in the latter case, partially answering a question asked by S. Golomb 26 years ago, we prove that (non-trivial) such arrays can only be sporadic and conjecture they do not exist at all.
منابع مشابه
Enumeration of Parallelograms in Permutation Matrices for Improved Bounds on the Density of Costas Arrays
A Costas array of order n is an n× n permutation matrix such that all vectors between pairs of ones are distinct. Thus, a permutation matrix fails to be a Costas array if and only if it contains ones that form a (possibly degenerate) parallelogram. In this paper, we enumerate parallelograms in an n × n permutation matrix. We use our new formulas to improve Davies’s O(n−1) result for the density...
متن کاملStructural properties of Costas arrays
We apply combinatorial arguments to establish structural constraints on Costas arrays. We prove restrictions on when a Costas array can contain a large corner region whose entries are all 0. In particular, we prove a 2010 conjecture due to Russo, Erickson and Beard. We then constrain the vectors joining pairs of 1s in a Costas array by establishing a series of results on its number of “mirror p...
متن کاملCostas Arrays Ii. Structural Properties
We prove restrictions on when a Costas array can contain a large corner region whose entries are all 0. In particular, we prove a 2010 conjecture due to Russo, Erickson and Beard. We constrain the vectors joining pairs of 1s in a Costas array by establishing a series of results on its number of “mirror pairs,” namely pairs of these vectors having the same length but opposite slopes.
متن کاملThe T4 and G4 constructions for Costas arrays
B.Ya. Ryabko, " Data compression by means of a book stack, Probl. Abstract-Two of the algebraic constructions for Costas arrays, designated as T4 and C,, are described in detail, and necessary and sufficient conditions are given for the sizes of Costas arrays for which these constructions occur. These constructions depend on the existence of primitive roots satisfying certain equations in finit...
متن کاملAlgebraic Symmetries of Generic Multidimensional Periodic Costas Arrays and their importance in the enumeration of Multidimensional Periodic Sonar Arrays
We present two symmetries of the generic multidimensional periodic Costas arrays over elementary abelian groups. Through exhaustive search, we observe that these two symmetries generate the Costas arrays for the enumeration up to p = 5 (5x5x24). Following the results, we conjecture that these generators characterize the group of symmetries of the generic (m+1)-dimensional periodic Costas arrays...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 3 شماره
صفحات -
تاریخ انتشار 2009